关于布朗运动“记忆”效应的一个模型

布朗运动能够概括一大类物理现象,因此一直受到人们的重视。近年来,计算机模拟和实验的结果都表明,布朗运动具有“记忆”效应。本文试图对布朗运动“记忆”效应构造一个模型。在稳定情况下计算结果表明,微粒位移涨落的二次矩仍与时间间隔t成正比,“记忆”效应表现为流体的粘滞性加大。     

梁、板非线性动力响应分析的样条有限点法

本文用样条有限点法分析梁和基于Berger假设的板的几何非线性动力响应,推导了以样条结点参数表示的基本方程,用wilson-θ法求解动力增量方程,求得挠度响应曲线。本文的方法与有限元法比较,共计算时间省,程序简单,可在微机上计算。     

凸集支撑函数的性质及其应用

本文讨论一个凸集C 的支撑函数的几个有用性质,并把这些性质应用于对函数次微分的研究,得到有关函数次微分的几个有趣结果。     

相空间有限元方法在解二维中子输运方程中的应用

本文采用相空间有限元方法求解了柱形临界多群中子输运问题。其中对于方程中的坐标变量用分片连续线性多项式作为试探函数,对于方程中的角度变量用分片连续双线性多项式作为试探函数。整个求解空间区域和角度区域分别采用三角形和矩形单元划分,然后利用迦辽金方法得到一个以网格点处角通量为未知数的线性联立代数方程组,方程组中的系数矩阵的存储采用了压缩存储技术。最后用高斯消元法解此有限元方程组,表明相空间有限元方法计算收敛性较好、计算精度高。     

偶变元MAI旋转对称布尔函数

代数免疫度是布尔函数的一个重要密码学指标.给出了具有最大代数免疫度的偶数元旋转对称布尔函数的两种构造方法.进一步地,研究了特殊情形时所构造的旋转对称布尔函数的非线性度,当n≥18时,构造3得到的MAI旋转对称布尔函数的非线性度优于已知构造的偶数元MAI旋转对称布尔函数的非线性度.     

关于部分K值逻辑中正则可离函数集的极大封闭集之最小覆盖判定的一些结果

根据部分多值逻辑完备性理论,证明了当m=2时,若正则可离关系G2=G2({1,2})∪G2之关系图仅是一个回路,则T(G2)不是P k的最小覆盖成员.     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Safe distances

This work highlights the problem in military operations of setting safety limits for friendly forces, neutral forces, or civilians, to avoid sustaining unnecessary casualties both in wartime and in training. We present and investigate an analytic model which both enables the quantitative understanding of the inherent problems, and which furnishes a reasonably flexible tool in the hands of the analyst. Characteristic numerical results are displayed and analyzed: They show in particular that prevailing crude approximations are inadequate. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 259–269, 2001     

基于单元变形的网格间流场信息传递方法

针对单元网格发生变形重构中新旧网格之间的数据插值问题,提出一种基于格点格式有限体积法的流场数据传递方法。利用非结构动网格技术,将旧网格单元移动到新网格单元,同时时间推进求解流场控制方程,获得移动后旧网格单元物理量,并将其赋给新网格单元,以此来实现两套网格间的信息传递。计算结果表明,该方法在信息传递过程中没有引入插值误差,理论上流场求解方法的精度就是信息传递精度,验证结果表明其显著优于二阶插值精度。     

关于亚纯函数微分多项式的值分布

运用Nevanlinna的亚纯函数理论方法,研究了亚纯函数微分多项式的值的分布理论,获得了若f(z)是超越亚纯函数,ψ是关于f的微分多项式,满足条件N(r,f) N(r,1/f)=S(r,f),关于ψ零点的几个结果,改进并推广了Yang C C和仪洪勋等人的有关结果.